Rewriting logic: roadmap and bibliography

Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30–June 3, 1994, Selected Papers, Lecture Notes in Computer Science, Vol. 906, Springer, Berlin, 1995, pp. 351–367. [201] M. Leucker, T. Noll, Rewriting logic as a framework for generic veri9cation tools, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 117–133, http://www.elsevier.nl/locate/entcs/volume36.html. N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 147 [202] P. Lincoln, J. Meseguer, Strategic reQection, in: B. Gramlich, F. Pfenning (Eds.), Proc. of the CADE-15 Workshop on Strategies in Automated Deduction, Lindau, Germany, July, 1998, pp. 3–9. [203] P. Lincoln, N. Mart'(-Oliet, J. Meseguer, Speci9cation, transformation, and programming of concurrent systems in rewriting logic, in: G.E. Blelloch, K.M. Chandy, S. Jagannathan (Eds.), Speci9cation of Parallel Algorithms, DIMACS Workshop, May 9–11, 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 18, American Mathematical Society, Providence, RI, 1994, pp. 309–339. [204] P. Lincoln, N. Mart'(-Oliet, J. Meseguer, L. Ricciulli, Compiling rewriting onto SIMD and MIMD=SIMD machines, in: C. Halatsis, D. Maritsas, G. Philokyprou, S. Theodoridis (Eds.), PARLE’94 Parallel Architectures and Languages Europe, 6th Internat. PARLE Conf., Athens, Greece, July 4–8, 1994, Proceedings, Lecture Notes in Computer Science, Vol. 817, Springer, Berlin, 1994, pp. 37–48. [205] M. Lowry, T. Pressburger, G. RoW su, Certifying domain-speci9c policies, Technical report, Research Institute for Advanced Computer Science, 2001. [206] D. Lucanu, Algebraic speci9cation of object aggregation — an event oriented approach, in: K. Futatsugi, J.A. Goguen, J. Meseguer (Eds.), OBJ=CafeOBJ=Maude Workshop at Formal Methods’99: Formal Speci9cation, Proof, and Applications, Theta, Bucharest, 1999, pp. 115–132. [207] D. Lucanu, Relaxed models for rewriting logic, Manuscript, July, 2000, submitted for publication. [208] N. Mart'(-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, D. Gabbay (Ed.), Handbook of Philosophical Logic, Second Edition, Vol. 9, Kluwer Academic Publishers, Dordrecht, 2002, http://maude.csl.sri.com/papers. [209] N. Mart'(-Oliet, J. Meseguer, General logics and logical frameworks, in: D.M. Gabbay (Ed.), What is a Logical System?, Studies in Logic and Computation, Vol. 4, Oxford University Press, Oxford, 1994, pp. 355–392. [210] N. Mart'(-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Application, WRLA’ 96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 189–224, http://www.elsevier.nl/locate/entcs/volume4.html. [211] N. Mart'(-Oliet, J. Meseguer, Action and change in rewriting logic, in: R. Pareschi, B. FronhV ofer (Eds.), Dynamic Worlds: From the Frame Problem to Knowledge Management, Applied Logic Series, Vol. 12, Kluwer Academic Publishers, Dordrecht, 1999, pp. 1–53. [212] I.A. Mason, C.L. Talcott, A semantics preserving actor translation, in: P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (Eds.), Automata, Languages and Programming, 24th Internat. Colloquium, ICALP’97, Bologna, Italy, July 1997, Proceedings, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 369–378. [213] I.A. Mason, C.L. Talcott, Simple network protocol simulation within Maude, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 277–294, http://www.elsevier.nl/locate/entcs/volume36.html. [214] J. Meseguer, A logical theory of concurrent objects, in: N. Meyrowitz (Ed.), Proc. ECOOP-OOPSLA’90 Conf. on Object-Oriented Programming, Ottawa, Canada, October, 1990, ACM Press, New York, 1990, pp. 101–115. [215] J. Meseguer, Rewriting as a uni9ed model of concurrency, Technical Report SRI-CSL-90-02R, SRI International, Computer Science Laboratory, February, 1990, Revised June, 1990. Appendices on functorial semantics have not been published elsewhere. [216] J. Meseguer, Rewriting as a uni9ed model of concurrency, in: J.C.M. Baeten, J.W. Klop (Eds.), CONCUR’90, Theories of Concurrency: Uni9cation and Extension, Amsterdam, The Netherlands, August 1990, Proceedings, Lecture Notes in Computer Science, Vol. 458, Springer, Berlin, 1990, pp. 384–400. [217] J. Meseguer, Conditional rewriting logic: deduction, models and concurrency, in: S. Kaplan, M. Okada (Eds.), Conditional and Typed Rewriting Systems, 2nd Internat. CTRS Workshop, Montreal, Canada, June 11–14, 1990, Proceedings, Lecture Notes in Computer Science, Vol. 516, Springer, Berlin, 1991, pp. 64–91. [218] J. Meseguer, Conditional rewriting logic as a uni9ed model of concurrency, Theoret. Comput. Sci. 96 (1) (1992) 73–155. 148 N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 [219] J. Meseguer, Multiparadigm logic programming, in: H. Kirchner, G. Levi (Eds.), Algebraic and Logic Programming, 3rd Internat. Conf., Volterra, Italy, September 2–4, 1992, Proceedings, Lecture Notes in Computer Science, Vol. 632, Springer, Berlin, 1992, pp. 158–200. [220] J. Meseguer, A logical theory of concurrent objects and its realization in the Maude language, in: G. Agha, P. Wegner, A. Yonezawa (Eds.), Research Directions in Concurrent Object-Oriented Programming, The MIT Press, Cambridge, MA, 1993, pp. 314–390. [221] J. Meseguer, Solving the inheritance anomaly in concurrent object-oriented programming, in: O.M. Nierstrasz (Ed.), ECOOP’93 — Object-Oriented Programming, 7th Europ. Conf. Kaiserslautern, Germany, July 26–30, 1993, Proceedings, Lecture Notes in Computer Science, Vol. 707, Springer, Berlin, 1993, pp. 220–246. [222] J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996. http://www.elsevier.nl/locate/entcs/volume4.html. [223] J. Meseguer, Rewriting logic as a semantic framework for concurrency: a progress report, in: U. Montanari, V. Sassone (Eds.), CONCUR’96: Concurrency Theory, 7th Internat. Conf., Pisa, Italy, August 26–29, 1996, Proceedings, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 331–372. [224] J. Meseguer, Formal interoperability, in: Proc. of the 1998 Conference on Mathematics in Arti9cial Intelligence, Fort Laurerdale, Florida, January, 1998, http://rutcor.rutgers.edu/∼amai/ Proceedings.html. Presented also at the 14th IMACS World Congress, Atlanta, Georgia, July, 1994. [225] J. Meseguer, A logical framework for distributed systems and communication protocols, in: S. Budkowski, A. Cavalli, E. Najm (Eds.), Formal Description Techniques and Protocol Speci9cation, Testing and Veri9cation, FORTE=PSTV’98 IFIP TC6 WG6.1 Joint Internat. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Speci9cation, Testing and Veri9cation (PSTV XVIII), November 3–6, 1998, Paris, France, International Federation for Information Processing, Vol. 135, Kluwer Academic Publishers, Dordrecht, 1998, pp. 327–333. [226] J. Meseguer, Membership algebra as a logical framework for equational speci9cation, in: F. Parisi-Presicce (Ed.), Recent Trends in Algebraic Development Techniques, 12th Internat. Workshop, WADT’97, Tarquinia, Italy, June 3–7, 1997, Selected Papers, Lecture Notes in Computer Science, Vol. 1376, Springer, Berlin, 1998, pp. 18–61. [227] J. Meseguer, Research directions in rewriting logic, in: U. Berger, H. Schwichtenberg (Eds.), Computational Logic, Proc. of the NATO Advanced Study Institute on Computational Logic held in Marktoberdorf, Germany, July 29–August 6, 1997, NATO ASI Series F: Computer and Systems Sciences, Vol. 165, Springer, Berlin, 1998, pp. 347–398. [228] J. Meseguer, Rewriting logic and Maude: a wide-spectrum semantic framework for object-based distributed systems, in: S.F. Smith, C.L. Talcott (Eds.), Proc. IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems IV, FMOODS 2000, September 6–8, 2000, Stanford, CA, USA, Kluwer Academic Publishers, Dordrecht, 2000, pp. 89–117. [229] J. Meseguer, Rewriting logic and Maude: concepts and applications, in: L. Bachmair (Ed.), Rewriting Techniques and Applications, 11th Internat. Conf., RTA 2000, Norwich, UK, July 10–12, 2000, Proceedings, Lecture Notes in Computer Science, Vol. 1833, Springer, Berlin, 2000, pp. 1–26. [230] J. Meseguer, N. Mart'(-Oliet, From abstract data types to logical frameworks, in: E. Astesiano, G. Reggio, A. Tarlecki (Eds.), Recent Trends in Data Type Speci9cation, 10th Workshop on Speci9cation of Abstract Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30–June 3, 1994, Selected Papers, Lecture Notes in Computer Science, Vol. 906, Springer, Berlin, 1995, pp. 48–80. [231] J. Meseguer, U. Montanari, Mapping tile logic into rewriting logic, in: F. Parisi-Presicce (Ed.), Recent Trends in Algebraic Development Techniques, 12th Internat. Workshop, WADT’97, Tarquinia, Italy, June 3–7, 1997, Selected Papers, Lecture Notes in Computer Science, Vol. 1376, Springer, Berlin, 1998, pp. 62–91. [232] J. Meseguer, C.L. Talcott, Using rewriting logic to interoperate architectural description languages (I and II), Lectures at the Santa Fe and Seattle DARPA-EDCS Workshops, March and July 1997, http://www-formal.stanford.edu/clt/ArpaNsf/adl-interop.html. N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 149 [233] J. Meseguer, C.L. Talcott, Mapping OMRS to rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-X a-Mousson, France, September 1–4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 345–366, http://www.elsevier.nl/locate/entcs/volume15.html. Full version in preparation. Full version in preparation. [234] J. Meseguer, C.L. Talcott, A partial order event model for concurrent objects, in: J.C.M. Baeten, S. Mauw (Eds.), CONCUR’99, Concurrency Theory, 10th Internat. Conf. Eindhoven, The Netherlands, August 24–27, 1999, Proceedings, Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999, pp. 415–430. [235] J. Meseguer, T. Winkler, Parallel programming in Maude, in: J.-P. Banâtre, D. Le MX etayer (Eds.), Research Directions in High-level Parallel Programming Languages, Mont Saint-Michel, France, June 17–19, 1991, Proceedings, Lecture Notes in Computer Science, Vol. 574, Springer, Berlin, 1992, pp. 253–293. [236] J. Meseguer, X. Qian, A logical semantics for object-oriented databases, in: P. Buneman, S. Jajodia (Eds.), Proc. Internat. SIGMOD Conf. on Management of Data, ACM, New York, 1993, pp. 89–98. [237] J. Meseguer, K. Futatsugi, T. Winkler, Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents, in: Proc. of the 1992 International Symposium on New Models for Software Architecture, Tokyo, Japan, November 1992, Research Institute of Software Engineering, pp. 61–106. [238] J. Meseguer, M.-O. Stehr, C.L. Talcott, Specifying the PLAN language in Maude, 2000, Slides available at http://www-formal.stanford.edu/clt/Talks/00sep-utokyo-talk.ps.gz. [239] J. Millen, Applications of term rewriting to cryptographic protocol analysis, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 229–234, http://www.elsevier.nl/locate/entcs/volume36.html. [240] H. Miyoshi, Modelling conditional rewriting logic in structured categories. in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 20–34, http://www.elsevier.nl/locate/entcs/volume4.html. [241] U. Montanari, C.L. Talcott, Can actors and pi-agents live together?, in: A.D. Gordon, A.M. Pitts, C.L. Talcott (Eds.), Proc. 2nd Workshop on Higher-Order Operational Techniques in Semantics, HOOTS’98, Electronic Notes in Theoretical Computer Science, Vol. 10, Elsevier, Amsterdam, 1998. [242] P.-E. Moreau, A choice-point library for backtrack programming, in: JICSLP’98 Post-Conf. Workshop on Implementation Technologies for Programming Languages based on Logic, June, 1998. [243] P.-E. Moreau, Compilation de RX egles de R' e' ecriture et de Strat' egies Non-D' eterministes, Ph.D. Thesis, Universit' e Henri Poincar' e — Nancy I, June, 1999. [244] P.-E. Moreau, H. Kirchner, Compilation of associative-commutative normalisation with strategies in ELAN (full version), Technical Report 97-R-129, LORIA, Nancy, France, 1997. [245] P.-E. Moreau, H. Kirchner, Compilation techniques for associative-commutative normalisation, in: M.P.A. Sellink (Ed.), 2nd Internat. Workshop on the Theory and Practice of Algebraic Speci9cations, Amsterdam, The Netherlands, September 25–26, 1997, Electronic Workshops in Computing, Springer, Berlin, 1998, http://www.ewic.org.uk/ewic/workshop/view.cfm/ASFSDF-97. [246] P.-E. Moreau, H. Kirchner, A compiler for rewrite programs in associative-commutative theories, in: C. Palamidessi, H. Glaser, K. Meinke (Eds.), Principles of Declarative Programming, 10th Internat. Symp. PLIP’98 Held Jointly with the 6th Conference ALP’98, Pisa, Italy, September 16–18, 1998, Proceedings, Lecture Notes in Computer Science, Vol. 1490, Springer, Berlin, 1998, pp. 230–249. [247] P.D. Mosses, Semantics, modularity, and rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-X a-Mousson, France, September 1–4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, http://www.elsevier.nl/locate/entcs/volume15.html. [248] P.D. Mosses, Logical speci9cation of operational semantics, in: J. Flum, M. Rodr'(guez-Artalejo (Eds.), Computer Science Logic, 13th Internat. Workshop, CSL’99, 8th Ann. Conf. of the EACSL, Madrid, Spain, September 20–25, 1999, Proceedings, Lecture Notes in Computer Science, Vol. 1683, Springer, Berlin, 1999, pp. 32–49. 150 N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 [249] E. Najm, J.-B. Stefani, A formal operational semantics for the ODP computational model with signals, explicit binding, and reactive objects, Manuscript, ENST, Paris, France, 1994. [250] E. Najm, J.-B. Stefani, A formal semantics for the ODP computational model, Comput. Networks ISDN Systems 27 (1995) 1305–1329. [251] E. Najm, J.-B. Stefani, Computational models for open distributed systems, in: H. Bowman, J. Derrick (Eds.), Proc. 2nd IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems, FMOODS’97, July 21–23, 1997, Canterbury, Kent, UK, Chapman & Hall, London, 1997, pp. 157–176. [252] S. Nakajima, Encoding mobility in CafeOBJ: an exercise of describing mobile code-based software architecture, in: K. Futatsugi (Ed.), Proc. of the CafeOBJ Symposium ’98, Numazu, Japan, CafeOBJ Project, April, 1998. [253] S. Nakajima, Using algebraic speci9cation techniques in development of object-oriented frameworks, in: J.M. Wing, J. Woodcock, J. Davies (Eds.), FM’99 — Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20–24, 1999 Proceedings, Vol. II, Lecture Notes in Computer Science, Vol. 1709, Springer, Berlin, 1999, pp. 1664–1683. [254] S. Nakajima, K. Futatsugi, An object-oriented modeling method for algebraic speci9cations in CafeOBJ, in: Proc. 19th Internat. Conf. on Software Engineering, Boston, MA, May 1997, IEEE Computer Society Press, Silverspring, MD, pp. 34–44. [255] M. Nakamura, K. Ogata, The evaluation strategy for head normal form with and without on-demand Qags, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 211–227, http://www. elsevier.nl/locate/entcs/volume36.html. [256] H. Nakashima, Cyber assistance for situated human information processing, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 295–296, http://www.elsevier.nl/locate/entcs/volume36.html. [257] P. Naumov, M.-O. Stehr, J. Meseguer, The HOL=NuPRL proof translator — a practical approach to formal interoperability, in: Theorem Proving in Higher Order Logics, 14th Internat. Conf. TPHOLs’2001, Edinburgh, Scotland, UK, September 3–6, 2001, Proceedings, Lecture Notes in Computer Science, Springer, Berlin, 2001. [258] T. Noll, On coherence properties in term rewriting models of concurrency, in: J.C.M. Baeten, S. Mauw (Eds.), CONCUR’99, Concurrency Theory, 10th Internat. Conf. Eindhoven, The Netherlands, August 24–27, 1999, Proceedings, Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999, pp. 478–493. [259] M. Numazawa, M. Kurihara, A. Ohuchi, A reQective language based on conditional term rewriting, Technical report, Division of Systems and Information Engineering, Hokkaido University, Sapporo, Japan, 1996. [260] K. Ogata, K. Futatsugi, An abstract machine for order-sorted conditional term rewriting systems, in: H. Comon (Ed.), Rewriting Techniques and Applications, 8th Internat. Conf., RTA’97, Sitges, Spain, June 2–5, 1997, Proceedings, Lecture Notes in Computer Science, Vol. 1232, Springer, Berlin, 1997, pp. 335–338. [261] K. Ogata, K. Futatsugi, Speci9cation and veri9cation of some classical mutual exclusion algorithms with CafeOBJ, in: K. Futatsugi, J.A. Goguen, J. Meseguer (Eds.), OBJ=CafeOBJ=Maude Workshop at Formal Methods ’99: Formal Speci9cation, Proof, and Applications, Theta, Bucharest, 1999, pp. 159–178. [262] P.C. V Olveczky, Speci9cation and analysis of real-time and hybrid systems in rewriting logic, Ph.D. Thesis, University of Bergen, Norway, 2000, http://maude.csl.sri.com/papers. [263] P.C. V Olveczky, S. Meldal, Speci9cation and prototyping of network protocols in rewriting logic, in: Proc. of NIK’98, Norsk Informatikk Konferanse, 1998. [264] P.C. V Olveczky, J. Meseguer, Specifying real-time systems in rewriting logic, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 283–308, http://www.elsevier.nl/locate/entcs/volume4.html. N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 151 [265] P.C. V Olveczky, J. Meseguer, Real-time Maude: a tool for simulating and analyzing real-time and hybrid systems, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 361–383, http://www. elsevier.nl/locate/entcs/volume36.html. [266] P.C. V Olveczky, J. Meseguer, Speci9cation of real-time and hybrid systems in rewriting logic, Theoret. Comput. Sci. (2002), submitted for publication. [267] P.C. V Olveczky, J. Meseguer, Specifying and analyzing real-time object systems in real-time Maude, Manuscript, Computer Science Laboratory, SRI International, 2001, submitted for publication. [268] P.C. V Olveczky, M. Keaton, J. Meseguer, C.L. Talcott, S. Zabele, Speci9cation and analysis of the AER=NCA active network protocol suite in Real-Time Maude, in: H. Hussmann (Ed.), Fundamental Approaches to Software Engineering, 4th Internat. Conf., FASE 2001, Held as Part of ETAPS 2001, Genova, Italy, April 2001, Proceedings, Lecture Notes in Computer Science, Vol. 2029, Springer, Berlin, 2001, pp. 333–347. http://maude.csl.sri.com/papers. [269] P.C. V Olveczky, P. Kosiuczenko, M. Wirsing, An object-oriented algebraic steam-boiler control speci9cation, in: J.-R. Abrial, E. BV orger, H. Langmaack (Eds.), Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, Lecture Notes in Computer Science, Vol. 1165, Springer, Berlin, 1996, pp. 379–402. [270] D. Pattinson, Modal logic for rewriting theories, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 173–191, http://www.elsevier.nl/locate/entcs/volume36.html. [271] I. Pita, N. Mart'(-Oliet, A Maude speci9cation of an object oriented database model for telecommunication networks, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 404–422, http://www.elsevier.nl/locate/entcs/volume4.html. [272] I. Pita, N. Mart'(-Oliet, Using reQection to specify transaction sequences in rewriting logic, in: J.L. Fiadeiro (Ed.), Recent Trends in Algebraic Development Techniques, 13th Internat. Workshop, WADT’98, Lisbon, Portugal, April 2–4, 1998, Selected Papers, Lecture Notes in Computer Science, Vol. 1589, Springer, Berlin, 1999, pp. 261–276. [273] I. Pita, N. Mart'(-Oliet, A Maude speci9cation of an object-oriented model for telecommunication networks, Theoret. Comput. Sci. 2002, submitted for publication. [274] J.F. Quesada, The Maude parser: parsing and meta-parsing -extended context-free grammars, Technical report, Computer Science Laboratory, SRI International, 2001, to appear. [275] C. Ringeissen, Prototyping combination of uni9cation algorithms with the ELAN rule-based programming language, in: H. Comon (Ed.), Rewriting Techniques and Applications, 8th Internat. Conf. RTA’97, Sitges, Spain, June 2–5, 1997, Proceedings, Lecture Notes in Computer Science, Vol. 1232, Springer, Berlin, 1997, pp. 323–326. [276] C. Ringeissen, Handling relations over 9nite domains in the rule-based system ELAN, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 193–210, http://www.elsevier.nl/locate/entcs/volume36.html. [277] D.E. Rodr'(guez, Case studies in the speci9cation and analysis of protocols in Maude, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 257–275, http://www.elsevier.nl/locate/entcs/volume36.html. [278] G. RoW su, K. Havelund, Generating optimal monitors from temporal formulae, Technical report, Research Institute for Advanced Computer Science, 2001. [279] B. Salmansberger, Objektorientierte Spezi9kation von verteilten Systemen in Maude am Beispiel eines Flughafens, Master’s Thesis, FakultV at fV ur Mathematik und Informatik, UniversitV at Passau, December, 1993. [280] M. S' anchez, J.L. Herrero, J.M. Murillo, J. Hern' andez, Guaranteing coherent software systems when composing coordinated components, in: A. Porto, G.-C. Roman (Eds.), Coordination Languages and 152 N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 Models, 4th Internat. Conf. COORDINATION 2000, Limassol, Cyprus, September 11–13, 2000, Proceedings, Lecture Notes in Computer Science, Vol. 1906, Springer, Berlin, 2000, pp. 341–346. [281] C. ScharS, D' eduction avec Contraintes et Simpli9cation dans les Th' eories ' Equationnelles, Ph.D. Thesis, Universit' e Henri Poincar' e — Nancy I, September, 1999. [282] W.M. Schorlemmer, Bi-rewriting rewriting logic, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996. pp. 265–282, http://www.elsevier.nl/locate/entcs/volume4.html. [283] W.M. Schorlemmer, Rewriting logic as a logic of special relations, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-' a-Mousson, France, September 1–4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 163–184. http://www.elsevier.nl/locate/entcs/volume15.html. [284] W.M. Schorlemmer, On specifying and reasoning with special relations, Ph.D. Thesis, Universitat PolitX ecnica de Catalunya, March, 1999. [285] W.M. Schorlemmer, Term rewriting in a logic of special relations, in: A.M. Haeberer (Ed.), Algebraic Methodology and Software Technology, 7th Internat. Conf. AMAST’98, Amazonia, Brazil, January 4–8, 1999, Proceedings, Lecture Notes in Computer Science, Vol. 1548, Springer, Berlin, 1999, pp. 178–195. [286] D.B. Skillicorn, D. Talia, Models and languages for parallel computation, ACM Comput. Surveys 30 (2) (1998) 123–169. [287] L.J. Steggles, Rewriting logic and Elan: prototyping tools for Petri nets with time, in: J.-M. Colom, M. Koutny (Eds.), Applications and Theory of Petri Nets 2001, 22nd Internat. Conf. ICATPN 2001, Newcastle upon Tyne, UK, June 25–29, 2001, Proceedings, Lecture Notes in Computer Science, Vol. 2075, Springer, Berlin, 2001, pp. 363–381. [288] L.J. Steggles, P. Kosiuczenko, A timed rewriting logic semantics for SDL: a case study of the alternating bit protocol, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-' a-Mousson, France, September 1–4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 295–316, http://www.elsevier.nl/locate/entcs/volume15.html. [289] L.J. Steggles, P. Kosiuczenko, A formal model for SDL speci9cations based on timed rewriting logic, Automat. Software Eng. 7 (1) (2000) 61–90. [290] M.-O. Stehr, CINNI — A generic calculus of explicit substitutions and its application to -, &and -calculi, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 71–92, http://www. elsevier.nl/locate/entcs/volume36.html. [291] M.-O. Stehr, A rewriting semantics for algebraic nets, in: C. Girault, R. Valk (Eds.), Petri Nets for System Engineering — A Guide to Modeling, Veri9cation, and Applications, Springer, Berlin, 2001. [292] M.-O. Stehr, Rewriting logic and type theory — from applications to uni9cation, Ph.D. Thesis, Computer Science Department, University of Hamburg, Germany, 2002, in preparation. [293] M.-O. Stehr, J. Meseguer, Pure type systems in rewriting logic, in: Proc. of LFM’99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September, 28, 1999, http://www.cs.bell-labs.com/∼felty/LFM99/. [294] M.-O. Stehr, J. Meseguer, P.C. V Olvczky, Representation and execution of Petri nets using rewriting logic as a uniform framework, in: J. Padberg (Ed.), Proc. UNIGRA’2001, Uniform Approaches to Graphical Process Speci9cation Techniques, Electronic Notes in Theoretical Computer Science, Genova, Italy, March=April 2001, Elsevier, Amsterdam, to appear. [295] M.-O. Stehr, J. Meseguer, P.C. V Olveczky, Rewriting logic as a unifying framework for Petri nets, in: H. Ehrig, G. Juhas, J. Padberg, G. Rozenberg (Eds.), Unifying Petri Nets, Lecture Notes in Computer Science, Springer, Berlin, 2001, to appear. [296] M.-O. Stehr, P. Naumov, J. Meseguer, A proof-theoretic approach to the HOL-Nuprl connection with applications to proof translation, in: M. Cerioli, P.D. Mosses, G. Reggio (Eds.), Proc. WADT=CoFI’01, 15th Internat. Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG, Genova, Italy, April 1–3, 2001, http://www.csl.sri.com/∼stehr/fi eng.html. N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 153 [297] Y. Tahara, F. Kumeno, A. Ohsuga, S. Honiden, An algebraic semantics of reQective objects, in: K. Futatsugi, S. Matsuoka (Eds.), Object-Technologies for Advanced Software, Second JSSST Internat. Symp. ISOTAS’96, Kanaza, Japan, March 11–15, 1996, Proceedings, Lecture Notes in Computer Science, Vol. 1049, Springer, Berlin, 1996, pp. 173–189. [298] C.L. Talcott, An actor rewriting theory, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 360–383, http://www.elsevier.nl/locate/entcs/volume4.html. [299] C.L. Talcott, Composable semantic models for actor theories, in: M. Abadi, T. Ito (Eds.), Theoretical Aspects of Computer Science, 3rd Internat. Symp. TACS’97, Sendai, Japan, September 23–26, 1997, Proceedings, Lecture Notes in Computer Science, Vol. 1281, Springer, Berlin, 1997, pp. 321–364. [300] C.L. Talcott, Interaction semantics for components of distributed systems, in: E. Najm, J.-B. Stefani (Eds.), Proc. IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems, FMOODS’96, Chapman & Hall, London, 1997, pp. 154–169. [301] C.L. Talcott, Towards a toolkit for actor system speci9cation, in: T. Rus (Ed.), Algebraic Methodology and Software Technology, 8th Internat. Conf. AMAST 2000, Iowa City, Iowa, USA, May 20–27, 2000, Proceedings, Lecture Notes in Computer Science, Vol. 1816, Springer, Berlin, 2000, pp. 391–406. [302] C.L. Talcott, Actor theories in rewriting logic, Theoret. Comput. Sci. (2001), submitted for publication. [303] M.P. Tarjuelo, Comparing Meseguer’s rewriting logic with the logic CRWL, in: Proc. WFLP 2001, Internat. Workshop on Functional and (Constraint) Logic Programming, Kiel, Germany, September 13–15, 2001. [304] M.P. Tarjuelo, Relating Meseguer’s rewriting logic with the constructor-based rewriting logic, Master’s Thesis, Facultad de Matem' aticas, Universidad Complutense de Madrid, Spain, May, 2001, http://maude.csl.sri.com/papers. [305] A. Toval, J.L, Fern' andez. Formally modeling UML and its evolution: a holistic approach, in: S.F. Smith, C.L. Talcott (Eds.), Proc. IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems IV, FMOODS 2000, September 6–8, 2000, Stanford, CA, USA, Kluwer Academic Publishers, Dordrecht, 2000, pp. 183–206. [306] A. Toval, J.L. Fern' andez, Improving system reliability via rigorous software modeling: the UML case, in: Proc. IEEE Aerospace Conf. Vol. 6, Big Sky, MT, USA, March 10–17, 2001, IEEE Press, New York, pp. 6–17. [307] M.G.J. van den Brand, P. Klint, C. Verhoef, Term rewriting for sale, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-X a-Mousson, France, September 1–4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 139–162, http://www.elsevier.nl/locate/entcs/ volume15.html. [308] M.G.J. van den Brand, C. Ringeissen, ASF+SDF parsing tools applied to ELAN, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 135–154, http://www.elsevier.nl/locate/entcs/volume36.html. [309] A. Verdejo, N. Mart'(-Oliet, Executing E-LOTOS processes in Maude, in: H. Ehrig, M. Grosse-Rhode, F. Orejas (Eds.), INT 2000, Integration of Speci9cation Techniques with Applications in Engineering, Extended Abstracts, Technical report 2000=04, Technische Universitat Berlin, March, 2000, pp. 49–53. [310] A. Verdejo, N. Mart'(-Oliet, Executing and verifying CCS in Maude, Technical Report 99-00, Departamento de Sistemas Inform' aticos y Programaci' on, Universidad Complutense de Madrid, February 2000, http://maude.csl.sri.com/casestudies/ccs. [311] A. Verdejo, N. Mart'(-Oliet, Implementing CCS in Maude, in: T. Bolognesi, D. Latella (Eds.), Formal Methods For Distributed System Development, FORTE=PSTV 2000 IFIP TC6 WG6.1 Joint Internat. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Speci9cation, Testing and Veri9cation (PSTV XX) October 10–13, 2000, Pisa, Italy, International Federation for Information Processing, Vol. 183, Kluwer Academic Publishers, Dordrecht, 2000, pp. 351–366. [312] A. Verdejo, I. Pita, N. Mart'(-Oliet, The leader election protocol of IEEE 1394 in Maude, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 154 N. Mart +-Oliet, J. Meseguer / Theoretical Computer Science 285 (2002) 121–154 2000, Kanazawa, Japan, September 18–20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 385–406, http://www.elsevier.nl/locate/entcs/ volume36.html. [313] P. Viry, La r' e' ecriture concurrente, Ph.D. Thesis, Universit' e de Nancy I, 1992. [314] P. Viry, Rewriting: an eSective model of concurrency, in: C. Halatsis, D. Maritsas, G. Philokyprou, S. Theodoridis (Eds.), PARLE’94 Parallel Architectures and Languages Europe, 6th Internat. PARLE Conf. Athens, Greece, July 4–8, 1994, Proceedings, Lecture Notes in Computer Science, Vol. 817, Springer, Berlin, 1994, pp. 648–660. [315] P. Viry, Rewriting modulo a rewrite system, Technical Report TR-95-20, Dipartimento di Informatica, UniversitX a di Pisa, December, 1995, ftp://ftp.di.unipi.it/pub/techreports/ TR-95-20.ps.Z. [316] P. Viry, Input=output for ELAN, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 51–64, http://www. elsevier.nl/locate/entcs/volume4.html. [317] P. Viry, Adventures in sequent calculus modulo equations, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-X a-Mousson, France, September 1–4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 367–378, http://www.elsevier.nl/locate/entcs/volume15.html. [318] P. Viry, Equational rules for rewriting logic, Theoret. Comput. Sci. (2002), submitted for publication. [319] E. Visser, Z. el A. Benaissa, A core language for rewriting, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-X a-Mousson, France, September 1–4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 25–44, http://www.elsevier.nl/locate/entcs/volume15.html. [320] M. Vittek, ELAN: Un Cadre Logique pour le Prototypage de Langages de Programmation avec Contraintes, Ph.D. Thesis, Universit' e Henri Poincar' e — Nancy I, November, 1994. [321] M. Vittek, A compiler for nondeterministic term rewriting systems, in: H. Ganzinger (Ed.), Rewriting Techniques and Applications, 7th Internat. Conf. RTA’96, New Brunswick, NJ, USA July 27–30, 1996, Proceedings, Lecture Notes in Computer Science, Vol. 1103, Springer, Berlin, 1996, pp. 154–168. [322] B.-Y. Wang, J. Meseguer, C.A. Gunter, Speci9cation and formal analysis of a PLAN algorithm in Maude, in: P.-A. Hsiung (Ed.), Proc. Internat. Workshop on Distributed System Validation and Veri9cation, Taipei, Taiwan, April, 2000, pp. 49–56. [323] T. Watanabe, Towards a foundation of computational reQection based on abstract rewriting (preliminary result), in: Proc. IMSA’95, Information-Technology Promotion Agency, Japan, 1995, pp. 143–145. [324] T. Watanabe, H. Ishikawa, K. Futatsugi, Towards declarative description of computational reQection, in: Proc. IMSA’96, Information-Technology Promotion Agency, Japan, 1996, pp. 113–128. [325] T. Winkler, Programming in OBJ and Maude, in: P. Lauer (Ed.), Functional Programming, Concurrency, Simulation and Automated Reasoning, International Lecture Series 1991–1992, McMaster University, Hamilton, Ontario, Canada, Lecture Notes in Computer Science, Vol. 693, Springer, Berlin, 1993, pp. 229–277. [326] M. Wirsing, A. Knapp, A formal approach to object-oriented software engineering, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3–6, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 321–359, http://www.elsevier.nl/locate/entcs/volume4.html. [327] M. Wirsing, A. Knapp, A formal approach to object-oriented software engineering, Theoret. Comput. Sci. (2002), submitted for publication. [328] M. Wirsing, F. Nickl, U. Lechner, Concurrent object-oriented speci9cation in SPECTRUM, in: Y. Inagaki (Ed.), Workshop on Algebraic and Object-Oriented Approaches to Software Science, Nagoya, Japan, 1995, pp. 39–70.